Conservative Extension in Positive/Negative Conditional Term Rewriting with Applications to Software Renovation Factories

نویسندگان

  • Wan Fokkink
  • Chris Verhoef
چکیده

We transpose a conservative extension theorem from structured operational semantics to conditional term rewriting. The result is useful for the development of software renovation factories, and for modular speci cation of abstract data types.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Conservative Extension in Positive /

We transpose a conservative extension theorem from structural operational semantics to conditional term rewriting. The result is useful for the development of software renovation factories, and for modular speciication of abstract data types.

متن کامل

A General Conservative Extension Theorem in Process Algebras with Inequalities

We prove a general conservative extension theorem for transition system based process theories with easy-to-check and reasonable conditions. The core of this result is another general theorem which gives sufficient conditions for a system of operational rules and an extension of it in order to ensure conservativity, that is, provable transitions from an original term in the extension are the sa...

متن کامل

A General Conservative Extension Theorem in Process Algebra

We proved a general conservative extension theorem for transition system based process theories with easy-to-check and reasonable conditions. The core of this result is another general theorem giving sufficient conditions for a system of operational rules and an extension ensuring that outgoing transitions from an original term in the extension are the same as in the original system. As a simpl...

متن کامل

A Conservative Look at Term Deduction Systems with Variable Binding

We set up a formal framework to describe term deduction systems such as tran sition system speci cations in the style of Plotkin and conditional term rewriting systems This framework has the power to express many sortedness general bind ing mechanisms and substitutions among other notions such as negative premises and unary predicates on terms The framework is used to present a conservativity f...

متن کامل

Generation of Software Renovation Factories from Compilers

When a compiler is designed carefully, it is possible to extract its grammar. We reengineer the extracted grammar to one that is geared towards reengineering. From this reengineering grammar we generate an architecture called a software renovation factory. This includes: generic analysis and transformation functionality and a native pattern language using the concrete syntax of the language for...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1999